<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    739. Daily Temperatures
   </h1>
   <p>
    Given a list of daily temperatures
    <code>
     T
    </code>
    , return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature.  If there is no future day for which this is possible, put
    <code>
     0
    </code>
    instead.
   </p>
   <p>
    For example, given the list of temperatures
    <code>
     T = [73, 74, 75, 71, 69, 72, 76, 73]
    </code>
    , your output should be
    <code>
     [1, 1, 4, 2, 1, 1, 0, 0]
    </code>
    .
   </p>
   <p>
    <b>
     Note:
    </b>
    The length of
    <code>
     temperatures
    </code>
    will be in the range
    <code>
     [1, 30000]
    </code>
    .
Each temperature will be an integer in the range
    <code>
     [30, 100]
    </code>
    .
   </p>
  </div>
  <div>
   <h1 class="question_title">
    739. 每日温度
   </h1>
   <p>
    根据每日
    <code>
     气温
    </code>
    列表，请重新生成一个列表，对应位置的输入是你需要再等待多久温度才会升高的天数。如果之后都不会升高，请输入&nbsp;
    <code>
     0
    </code>
    来代替。
   </p>
   <p>
    例如，给定一个列表&nbsp;
    <code>
     temperatures = [73, 74, 75, 71, 69, 72, 76, 73]
    </code>
    ，你的输出应该是&nbsp;
    <code>
     [1, 1, 4, 2, 1, 1, 0, 0]
    </code>
    。
   </p>
   <p>
    <strong>
     提示：
    </strong>
    <code>
     气温
    </code>
    列表长度的范围是&nbsp;
    <code>
     [1, 30000]
    </code>
    。每个气温的值的都是&nbsp;
    <code>
     [30, 100]
    </code>
    &nbsp;范围内的整数。
   </p>
  </div>
 </body>
</html>